首页> 外文OA文献 >Content-Centric Multicast Beamforming in Cache-Enabled Cloud Radio Access Networks
【2h】

Content-Centric Multicast Beamforming in Cache-Enabled Cloud Radio Access Networks

机译:支持缓存的云无线电中以内容为中心的多播波束成形   接入网络

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

Multicast transmission and wireless caching are effective ways of reducingair and backhaul traffic load in wireless networks. This paper proposes toincorporate these two key ideas for content-centric multicast transmission in acloud radio access network (RAN) where multiple base stations (BSs) areconnected to a central processor (CP) via finite-capacity backhaul links. EachBS has a cache with finite storage size and is equipped with multiple antennas.The BSs cooperatively transmit contents, which are either stored in the localcache or fetched from the CP, to multiple users in the network. Usersrequesting a same content form a multicast group and are served by a samecluster of BSs cooperatively using multicast beamforming. Assuming fixed cacheplacement, this paper investigates the joint design of multicast beamformingand content-centric BS clustering by formulating an optimization problem ofminimizing the total network cost under the quality-of-service (QoS)constraints for each multicast group. The network cost involves both thetransmission power and the backhaul cost. We model the backhaul cost using themixed $\ell_0/\ell_2$-norm of beamforming vectors. To solve this non-convexproblem, we first approximate it using the semidefinite relaxation (SDR) methodand concave smooth functions. We then propose a difference of convex functions(DC) programming algorithm to obtain suboptimal solutions and show theconnection of three smooth functions. Simulation results validate the advantageof multicasting and show the effects of different cache size and cachingpolicies in cloud RAN.
机译:组播传输和无线缓存是减少无线网络中空中和回程流量负载的有效方法。本文提出将这两个关键思想纳入到以无线电为中心的组播无线传输网络(RAN)中,其中多个基站(BS)通过有限容量的回程链路连接到中央处理器(CP)。每个BS都有一个具有有限存储大小的缓存,并配备了多个天线.BS协作地将存储在本地缓存中或从CP获取的内容传输到网络中的多个用户。请求相同内容的用户形成一个多播组,并由使用多播波束成形的BS的同一集群协作提供服务。假设固定的缓存位置,本文针对每个组播组制定服务质量(QoS)约束下使总网络成本最小化的优化问题,研究了组播波束成形和以内容为中心的BS集群的联合设计。网络成本涉及传输功率和回程成本。我们使用波束成形向量的混合$ \ ell_0 / \ ell_2 $范数对回程成本进行建模。为了解决这种非凸问题,我们首先使用半定松弛(SDR)方法和凹面光滑函数对其进行近似。然后,我们提出了一种凸函数(DC)编程算法的差异,以获得次优解,并展示了三个光滑函数的联系。仿真结果验证了组播的优势,并显示了云RAN中不同的缓存大小和缓存策略的影响。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号